Abstract fairness and semantics

Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay?

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

Explicit fairness in testing semantics

In this paper we investigate fair computations in the π-calculus [25]. Following Costa and Stirling’s approach for CCS-like languages [10, 11], we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion [35, 26] with those that naturally arise by imposing weak and strong fairness. This comparison provides insight about ...

Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay

Abstract Kripke Semantics

Kripke Semantics Yanjing Wang (Amsterdam) In this paper, we give a schema of non-standard Kripke semantics for modal logic, in which the meaning of a modality in a formula depends on the evaluation process of that formula. More precisely, in our semantics schema, the truth condition for a sub-formula [] A of B depends on the path of worlds we passed in the evaluation of B and the position of []...

Game Semantics & Abstract Machines

The inreraciioii processes at work iii Hylund arid Oizg (HO) urid Abrniiisky, .laguciee.snii uiidMulmaria (A.JM) new game seninritics are two preexisting pavadiginatic iiiipleriieriiafioiis ojlinear head reduction: re~I7ecfively Kriviiie’s RDsfrucr Machine and Girard4 Interactiori Abstract Mncli he. There is U simple oizd tiuirrral embedding ojA.lM-ganzes to MI-ganies, mappirig sirategies to sr...